PTree: pattern-based, stochastic search for maximum parsimony phylogenies
نویسندگان
چکیده
منابع مشابه
PTree: pattern-based, stochastic search for maximum parsimony phylogenies
Phylogenetic reconstruction is vital to analyzing the evolutionary relationship of genes within and across populations of different species. Nowadays, with next generation sequencing technologies producing sets comprising thousands of sequences, robust identification of the tree topology, which is optimal according to standard criteria such as maximum parsimony, maximum likelihood or posterior ...
متن کاملLocal Search for the Maximum Parsimony Problem
Four local search algorithms are investigated for the phylogenetic tree reconstruction problem under the Maximum Parsimony criterion. A new subtree swapping neighborhood is introduced and studied in combination with an effective array-based tree representation. Computational results are shown on a set of randomly generated benchmark instances as well as on 8 real problems (sequences of phytopat...
متن کاملFaster exact maximum parsimony search with XMP
MOTIVATION Despite trends towards maximum likelihood and Bayesian criteria, maximum parsimony (MP) remains an important criterion for evaluating phylogenetic trees. Because exact MP search is NP-complete, the computational effort needed to find provably optimal trees skyrockets with increasing numbers of taxa, limiting analyses to around 25-30 taxa. This is, in part, because currently available...
متن کاملA Corrected Parsimony Criterion for Reconstructing Phylogenies
In phylogenetic analysis, for non-molecular data, particularly morphology, parsimony optimization is the most commonly employed approach. In the past and present application of the parsimony principle, extra step numbers have been added across different characters without proper justification. This practice, however, has caused the impacts of characters to be inflated or deflated without a vali...
متن کاملA tabu search algorithm for maximum parsimony phylogeny inference
Phylogeny reconstruction is too complex a combinatorial problem for an exhaustive search, because the number of possible solutions increases exponentially with the number of taxa involved. In this paper, we adopt the parsimony principle and design a tabu search algorithm for finding a most parsimonious phylogeny tree. A special array structure is employed to represent the topology of trees and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: PeerJ
سال: 2013
ISSN: 2167-8359
DOI: 10.7717/peerj.89